Assessing network robustness under SIS epidemics: The relationship between epidemic threshold and viral conductance

نویسندگان

  • Annalisa Socievole
  • Floriano De Rango
  • Caterina M. Scoglio
  • Piet Van Mieghem
چکیده

Telecommunication networks, as well as other network types, are critical infrastructures where any service disruption has a notable impact on individuals. Hence, studying network dynamics under failures or attacks is of paramount importance. In this paper, we assess the robustness of networks with respect to the spread of Susceptible-Infected-Susceptible (SIS) epidemics, using the N-Intertwined Mean-Field Approximation (NIMFA). A classical robustness metric is the NIMFA epidemic threshold, which is inversely proportional to the largest eigenvalue of the adjacency matrix, also called the spectral radius. Besides the NIMFA epidemic threshold, the viral conductance has been proposed as a measure incorporating the average fraction of infected nodes in the steady state for all possible effective infection rates. In general, the viral conductance provides more information about the network’s behavior with respect to virus spreading, however, the full picture is not always necessary. The aim of this paper is to understand when the spectral radius is adequate for reflecting robustness. By analyzing the relationship between spectral radius and viral conductance in several graph classes, we show that the two metrics are highly correlated. We thus conclude that the spectral radius is sufficient to compare the robustness of networks belonging to the same class. © 2016 Elsevier B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The viral conductance of a network

Besides the epidemic threshold, the recently proposed viral conductance w by Kooij et al. [11] may be regarded as an additional characterizer of the viral robustness of a network, that measures the overall ease in which viruses can spread in a particular network. Motivated to explain observed features of the viral conductance w in simulations [29], we have analysed this metric in depth using th...

متن کامل

Susceptible-infected-susceptible epidemics on networks with general infection and cure times.

The classical, continuous-time susceptible-infected-susceptible (SIS) Markov epidemic model on an arbitrary network is extended to incorporate infection and curing or recovery times each characterized by a general distribution (rather than an exponential distribution as in Markov processes). This extension, called the generalized SIS (GSIS) model, is believed to have a much larger applicability...

متن کامل

Inferring Epidemic Parameters in Networked SIS Epidemics

The mathematical modeling and analysis of epidemic spread is of great importance in understating how epidemics behave and and how to control them, and it has attracted significant interest from different communities. The study of epidemics applies to many areas such as epidemiology [1], rumor spread [2, 3], information propagation [4, 5], network security [6, 7], and viral marketing [8, 9]. Alt...

متن کامل

Resilience of epidemics for SIS model on networks.

Epidemic propagation on complex networks has been widely investigated, mostly with invariant parameters. However, the process of epidemic propagation is not always constant. Epidemics can be affected by various perturbations and may bounce back to its original state, which is considered resilient. Here, we study the resilience of epidemics on networks, by introducing a different infection rate ...

متن کامل

Work in Progress: A new metric for robustness with respect to virus spread

The robustness of a network is depending on the type of attack we are considering. In this paper we focus on the spread of viruses on networks. It is common practice to use the epidemic threshold as a measure for robustness. Because the epidemic threshold is inversely proportional to the largest eigenvalue of the adjacency matrix, it seems easy to compare the robustness of two networks. We will...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Networks

دوره 103  شماره 

صفحات  -

تاریخ انتشار 2016